11![A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-depth Jaroslav Neˇsetˇril Patrice Ossona de Mendez Author address: A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-depth Jaroslav Neˇsetˇril Patrice Ossona de Mendez Author address:](https://www.pdfsearch.io/img/9d9a3e5b5f4116579846f1076a93b8f0.jpg) | Add to Reading ListSource URL: iti.mff.cuni.czLanguage: English - Date: 2016-02-04 05:53:38
|
---|
12![Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f](https://www.pdfsearch.io/img/9a1245817bde742d315f9fbcb1e37061.jpg) | Add to Reading ListSource URL: www.cse.chalmers.seLanguage: English - Date: 2015-11-05 15:42:28
|
---|
13![LOCAL LIPSCHITZ CONTINUITY OF THE DIAMETRIC COMPLETION MAPPING J. P. MORENO AND R. SCHNEIDER Abstract. The diametric completion mapping associates with every closed bounded set C in a normed linear space the set γ(C) of LOCAL LIPSCHITZ CONTINUITY OF THE DIAMETRIC COMPLETION MAPPING J. P. MORENO AND R. SCHNEIDER Abstract. The diametric completion mapping associates with every closed bounded set C in a normed linear space the set γ(C) of](https://www.pdfsearch.io/img/7dd15af348afe27616d5d1fe46780f2a.jpg) | Add to Reading ListSource URL: home.mathematik.uni-freiburg.deLanguage: English - Date: 2010-08-18 13:21:34
|
---|
14![The Grad of a Graph and Classes with Bounded Expansion Jaroslav Neˇsetˇril 1 Department of Applied Mathematics and Institute of Theoretical Computer Science Charles University Praha, Czech Republic The Grad of a Graph and Classes with Bounded Expansion Jaroslav Neˇsetˇril 1 Department of Applied Mathematics and Institute of Theoretical Computer Science Charles University Praha, Czech Republic](https://www.pdfsearch.io/img/078559d9984ea7b5a2799afdc550d7a6.jpg) | Add to Reading ListSource URL: iti.mff.cuni.czLanguage: English - Date: 2016-02-04 05:53:37
|
---|
15![PTAS for maximum weight independent set problem with random weights in bounded degree graphs David Gamarnik ∗ PTAS for maximum weight independent set problem with random weights in bounded degree graphs David Gamarnik ∗](https://www.pdfsearch.io/img/34f6d909a809109fd7fb289641ccb835.jpg) | Add to Reading ListSource URL: www2.isye.gatech.eduLanguage: English - Date: 2010-01-29 01:03:37
|
---|
16![Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f](https://www.pdfsearch.io/img/89d8009fd48b582937a13e02bf423427.jpg) | Add to Reading ListSource URL: www.cse.chalmers.seLanguage: English - Date: 2015-11-05 15:42:28
|
---|
17![A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension∗ Esther Ezra† Abstract Let (X, S) be a set system on an n-point set X. The discrepancy of S is defined as the minimum of the A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension∗ Esther Ezra† Abstract Let (X, S) be a set system on an n-point set X. The discrepancy of S is defined as the minimum of the](https://www.pdfsearch.io/img/13f2ea2e7414917d62f87eff477ca774.jpg) | Add to Reading ListSource URL: www.cims.nyu.eduLanguage: English - Date: 2014-07-17 15:05:51
|
---|
18![BRICS Basic Research in Computer Science BRICS RSBrodal et al.: Finding Maximal Pairs with Bounded Gap Finding Maximal Pairs with Bounded Gap BRICS Basic Research in Computer Science BRICS RSBrodal et al.: Finding Maximal Pairs with Bounded Gap Finding Maximal Pairs with Bounded Gap](https://www.pdfsearch.io/img/140215dac10a7e43969deb772e3bb62d.jpg) | Add to Reading ListSource URL: www.brics.dkLanguage: English - Date: 1999-06-28 05:16:54
|
---|
19![Let X be an M×N grayscale image with n=MN pixels xi with values in the set {0, 1, …, 255} Let X be an M×N grayscale image with n=MN pixels xi with values in the set {0, 1, …, 255}](https://www.pdfsearch.io/img/59f6e45ee3202325be919b9f91261a80.jpg) | Add to Reading ListSource URL: www.ws.binghamton.eduLanguage: English - Date: 2006-04-26 08:10:12
|
---|
20![Aissen’s Convex Set Function Steven Finch September 29, 2014 Let D be a bounded open convex set in the plane and let C denote the boundary of D. For each p ∈ D and q ∈ C, let hpq be the Euclidean distance from p to Aissen’s Convex Set Function Steven Finch September 29, 2014 Let D be a bounded open convex set in the plane and let C denote the boundary of D. For each p ∈ D and q ∈ C, let hpq be the Euclidean distance from p to](https://www.pdfsearch.io/img/08af122e01c2c0b95c7206fde29f049f.jpg) | Add to Reading ListSource URL: www.people.fas.harvard.eduLanguage: English - Date: 2014-09-28 19:14:42
|
---|